On the P versus NP intersected with co-NP question in communication complexity
نویسندگان
چکیده
منابع مشابه
On the P versus NP intersected with co-NP question in communication complexity
We consider the analog of the P versus NP∩ co-NP question for the classical two-party communication protocols where polynomial time is replaced by poly-logarithmic communication: if both a boolean function f and its negation ¬f have small (poly-logarithmic in the number of variables) nondeterministic communication complexity, what is then its deterministic and/or probabilistic communication com...
متن کاملAlchemistry of the P versus NP question
Are P and NP provably inseparable ? Take a look at some unorthodox, guilty mentioned folklore and related unpublished results.
متن کاملA Status Report on the P Versus NP Question
We survey some of the history of the most famous open question in computing: the P versus NP question. We summarize some of the progress that has been made to date, and assess the current situation.
متن کاملCSC 2429 – Approaches to the P versus NP Question
This is really what I consider the masthead result of [Mul99], but in the same paper Mulmuley also showed that P 6= RNC in the PRAM model without bit operations, and that the NC and RNC hierarchies are strict in this model, and furthermore that all of these results holds not just for the decision problems but even for the corresponding additive approximation problems. As the proof for these oth...
متن کاملCSC 2429 – Approaches to the P versus NP Question
The primary goal of complexity theory is to study the power of different computational resources: time, space, randomness, nondeterminism, and circuit size, to name a few. Yet despite decades of work from the best and brightest in the field, we seem to be very far from answering the most simple of questions, with P vs. NP being the most famous of these. For the successes we have found, we have ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Information Processing Letters
سال: 2005
ISSN: 0020-0190
DOI: 10.1016/j.ipl.2005.08.003